A Switching Markov Chain Monte Carlo Method for Statistical Identifiability of Nonlinear Pharmacokinetics Models
نویسندگان
چکیده
We study the convergence rate of MCMC on the statistically unidentifiable nonlinear model involving the Michaelis-Menten kinetic equation. We have shown that, under certain conditions, the convergence diagnosis of Raftery and Lewis (1992) is consistent with the convergence rate argued by Brooks and Roberts (1999). Therefore, different MCMC schemes developed in linear models are further extended and compared in nonlinear models. We demonstrate that the single component MCMC (SCM) scheme is faster than the group component MCMC (GCM) scheme on unidentifiable models, while GCM is faster than SCM when the model is statistically identifiable. A novel MCMC method is then developed using both SCM and GCM schemes, termed the Switching MCMC (SWM) method. The proposed SWM possesses an advantage in that it is able to estimate parameters regardless of the statistically identifiable situations. In addition, simulations and data analysis suggest a better performance of the proposed SWM algorithm than SCM and GCM.
منابع مشابه
Markov Chain Monte Carlo Methods and the Label Switching Problem in Bayesian Mixture Modelling
In the past ten years there has been a dramatic increase of interest in the Bayesian analysis of finite mixture models. This is primarily because of the emergence of Markov chain Monte Carlo (MCMC) methods. Whilst MCMC provides a convenient way to draw inference from complicated statistical models, there are many, perhaps under appreciated, problems associated with the MCMC analysis of mixtures...
متن کاملMarkov Chain Monte Carlo Methods and the Label Switching Problem in Bayesian Mixture Modeling
In the past ten years there has been a dramatic increase of interest in the Bayesian analysis of finite mixture models. This is primarily because of the emergence of Markov chain Monte Carlo (MCMC) methods. While MCMC provides a convenient way to draw inference from complicated statistical models, there are many, perhaps underappreciated, problems associated with the MCMC analysis of mixtures. ...
متن کاملIdentifying Business Cycle Turning Points with Sequential Monte Carlo Methods
We apply sequential Monte Carlo (SMC) to the detection of turning points in the business cycle and to the evaluation of useful statistics employed in business cycle analysis. The proposed nonlinear filtering method is very useful for sequentially estimating the latent variables and the parameters of nonlinear and non-Gaussian time-series models, such as the Markov-switching (MS) models studied ...
متن کاملIdentifying Business Cycle Turning Points with Sequential Monte Carlo Methods: an on-line and real time application to the Euro area
We apply sequential Monte Carlo (SMC) to the detection of turning points in the business cycle and to the evaluation of statistics currently employed in business cycle analysis. The proposed nonlinear filtering method is very useful for sequentially estimating the latent variables and the parameters of nonlinear and non-Gaussian time-series models, such as the Markov-switching (MS) models emplo...
متن کاملBayesian Mixture Labelling by Highest Posterior Density
A fundamental problem for Bayesian mixture model analysis is label switching, which occurs due to the non-identifiability of the mixture components under symmetric priors. We propose two labelling methods to solve this problem. The first method, denoted by PM(ALG), is based on the posterior modes and an ascending algorithm generically denoted ALG. We use each Markov chain Monte Carlo (MCMC) sam...
متن کامل